A Reconfigurable Processing Element for Cholesky Decomposition and Matrix Inversion
نویسندگان
چکیده
Fixed-point simulation results are used for the performance measure of inverting matrices by Cholesky decomposition. The fixed-point Cholesky decomposition algorithm is implemented using a fixed-point reconfigurable processing element. The reconfigurable processing element provides all mathematical operations required by Cholesky decomposition. The fixed-point word length analysis is based on simulations using different condition numbers and different matrix sizes. Simulation results show that 16 bits word length gives sufficient performance for small matrices with low condition number. Larger matrices and higher condition numbers require more dynamic range for a fixedpoint implementation. Keywords—Cholesky Decomposition, Fixed-point, Matrix inversion, Reconfigurable processing.
منابع مشابه
A Reconfigurable Processing Element Implementation for Matrix Inversion Using Cholesky Decomposition
Fixed-point simulation results are used for the performance measure of inverting matrices using a reconfigurable processing element. Matrices are inverted using the Cholesky decomposition algorithm. The reconfigurable processing element is capable of all required mathematical operations. The fixed-point word length analysis is based on simulations of different condition numbers and different ma...
متن کاملVariable Precision Floating-Point Divide and Square Root for Efficient FPGA Implementation of Image and Signal Processing Algorithms
Field Programmable Gate Arrays (FPGAs) are frequently used to accelerate signal and image processing algorithms due to their flexibility, relatively low cost, high performance and fast time to market. For those applications where the data has large dynamic range, floating-point arithmetic is desirable due to the inherent limitations of fixed-point arithmetic. Moreover, optimal reconfigurable ha...
متن کاملHigh Throughput Iterative VLSI Architecture for Cholesky Factorization Based Matrix Inversion
Cholesky factorization is the computationally most expensive step in numerically solving positive definite systems. Due to inherently recursive computation process and associated floating point division and square root operations in Cholesky factorization, it is very difficult to obtain acceleration by exploiting parallelism on FPGA’s. To solve this problem, approach suggests iterative architec...
متن کاملSome Modifications to Calculate Regression Coefficients in Multiple Linear Regression
In a multiple linear regression model, there are instances where one has to update the regression parameters. In such models as new data become available, by adding one row to the design matrix, the least-squares estimates for the parameters must be updated to reflect the impact of the new data. We will modify two existing methods of calculating regression coefficients in multiple linear regres...
متن کاملIncomplete Cholesky Parallel Preconditioners with Selective Inversion
Consider the solution of a large linear system when the coe cient matrix is sparse, symmetric, and positive de nite. One approach is the method of \conjugate gradient" (CG) with an incomplete Cholesky (IC) preconditioner (ICCG). A key problem with the design of a parallel ICCG solver is the bottleneck posed by repeated parallel sparse triangular solves to apply the preconditioner. Our work conc...
متن کامل